Succinct Non-Interactive Arguments from Quadratic Arithmetic Programs
نویسنده
چکیده
Verifiable computation in zero knowledge allows the verifier to prove that he performed the computation of a certain functionality correctly without having to repeat the entire computational process, and without revealing any details of the computation. Any program can be represented by a circuit, and verifying the correctness of the computation is equivalent to checking circuit satisfiability on given input and output. There exist cryptographic solutions to this task, based on reduction to different mathematical problems. This survey gives an overview of verifying circuit satisfiability (Circuit-SAT) in zero knowledge using quadratic arithmetic programs (QAP).
منابع مشابه
A Note on the Unsoundness of vnTinyRAM's SNARK
Gennaro, Gentry, Parno, and Raykova (GGPR) introduced Quadratic Arithmetic Programs (QAPs) as a way of representing arithmetic circuits in a form amendable to highly efficient cryptographic protocols [11], particularly for verifiable computation and succinct non-interactive arguments [12]. Subsequently, Parno, Gentry, Howell, and Raykova introduced an improved cryptographic protocol (and implem...
متن کاملSquare Span Programs with Applications to Succinct NIZK Arguments
We propose a new characterization of NP using square span programs (SSPs). We first characterize NP as affine map constraints on small vectors. We then relate this characterization to SSPs, which are similar but simpler than Quadratic Span Programs (QSPs) and Quadratic Arithmetic Programs (QAPs) since they use a single series of polynomials rather than 2 or 3. We use SSPs to construct succinct ...
متن کاملQuadratic Span Programs and Succinct NIZKs without PCPs
We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main motivation is the quick construction of succinct, easily verified arguments for NP statements. To achieve this goal, QSPs use a new approach to the well-known technique of arithmetization of Boolean circu...
متن کاملOn the Size of Pairing-Based Non-interactive Arguments
Non-interactive arguments enable a prover to convince a verifier that a statement is true. Recently there has been a lot of progress both in theory and practice on constructing highly efficient non-interactive arguments with small size and low verification complexity, so-called succinct non-interactive arguments (SNARGs) and succinct non-interactive arguments of knowledge (SNARKs). Many constru...
متن کاملErratum: Succinct Non-interactive Arguments via Linear Interactive Proofs
Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays researches have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A common relaxation is a preprocessing S...
متن کامل